Using Motion Planning and genetic Algorithms in Movement Optimization of industrial Robots

نویسندگان

  • Peter Husar
  • Pavol Bezák
چکیده

The issues of path and trajectory planning algorithms and optimization of industrial manipulator trajectory generation are still not completely solved due to their variability and increasing complexity with the growing number of robot degrees of freedom. Generation of an optimal trajectory can be solved in several ways, such as traditional numeric and more recent approaches, which include evolutionary algorithms and genetic algorithms within them. The first chapter is devoted to a brief overview of path planning methods, especially in mobile robots. The second chapter deals with a more detailed overview of robot path planning methods in continuous and discrete environments. The third chapter describes the most popular motion planning algorithms. The fourth chapter is dedicated to genetic algorithms which we used as an optimization method. The fifth chapter focuses on optimal robot motion control and optimization methods using genetic algorithms as the method for an industrial manipulator control. The next chapter contains a solution and its implementation in support software, as well as the experimental verification of the results. The last chapter evaluates the results and their benefits. Symbols Path and trajectory planning g(x) distance from start to finish h(x) distance from current node to finish l x , l y length of environment in x-and in y-axes n x , n y number of cells in x-and y-axes Genetic algorithms P population N number of population elements S population element F fitness function Θ selection operator Ω set of genetic operators Ψ reduction operator Τ accomplishment criterion Motion control q i (t) time function Q k set of tolerable system configurations Optimal motion control u(t) control x(t) control response 7 J(u) purpose function x & vector of state variables U vector of control A vector of non-linear state and control functions M(ϕ) matrix of mass C(ϕ) matrix of damping K(ϕ) matrix of stiffness ϕ vector degrees of freedom of general shift F(t) vector of control powers driving the x(t 0), x(t f) joint position at the beginning and end of motion

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trajectory Planning Using High Order Polynomials under Acceleration Constraint

The trajectory planning, which is known as a movement from starting to end point by satisfying the constraints along the path is an essential part of robot motion planning. A common way to create trajectories is to deal with polynomials which have independent coefficients. This paper presents a trajectory formulation as well as a procedure to arrange the suitable trajectories for applications. ...

متن کامل

Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs

In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...

متن کامل

Optimal Trajectory Planning of a Mobile Robot with Spatial Manipulator For Spatial Obstacle Avoidance

Mobile robots that consist of a mobile platform with one or many manipulators mounted on it are of great interest in a number of applications. Combination of platform and manipulator causes robot operates in extended work space. The analysis of these systems includes kinematics redundancy that makes more complicated problem. However, it gives more feasibility to robotic systems because of the e...

متن کامل

Direct Optimal Motion Planning for Omni-directional Mobile Robots under Limitation on Velocity and Acceleration

This paper describes a low computational direct approach for optimal motion planning and obstacle avoidance of Omni-directional mobile robots within velocity and acceleration constraints on the robot motion. The main purpose of this problem is the minimization of a quadratic cost function while limitation on velocity and acceleration of robot is considered and collision with any obstacle in the...

متن کامل

A New Mathematical Model in Cell Formation Problem with Consideration of Inventory and Backorder: Genetic and Particle Swarm Optimization Algorithms

Cell Formation (CF) is the initial step in the configuration of cell assembling frameworks. This paper proposes a new mathematical model for the CF problem considering aspects of production planning, namely inventory, backorder, and subcontracting. In this paper, for the first time, backorder is considered in cell formation problem. The main objective is to minimize the total fixed and variable...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011